k-p-Infix codes and semaphore codes

k-p-Infix codes and semaphore codes

In this paper we introduce the concepts of k-p-in x codes, n-k-ps-in x languages, n-k-in xout x codes, and n-k-pre x-su x languages, which are natural generalizations of our previous work on k-pre x codes, k-in x codes and so on. We obtain several properties of k-p-in x codes and semaphore codes. The relations and hierarchies of k-p-in x codes, n-k-ps-languages, and n-kpre x-su x languages, and...

Congruences, Infix and Cohesive Prefix Codes

Ito, M. and G. Thierrin, Congruences, infix and cohesive prefix codes, Theoretical Computer Science 136 (1994) 471 485. A language L _~ X * is called a cohesive prefix code if xLyc~L ~ 0 implies that y = 1 and xL c L for any x, y~X*. An example of cohesive prefix codes is an infix code. We determine first the structure of cohesive prefix codes and then we study several relationships between max...

Notes on Finite Maximal Infix Codes 1

The fact that every finite infix code is contained in a finite maximal infix code was given in 1994 by Ito and Thierrin. In this paper, we construct two kinds of maximal infix codes from a finite maximal infix code. Then we show that a finite infix code is a finite intersection of some finite maximal infix codes.

Random walks on semaphore codes and delay de Bruijn semigroups

On the Decidability of 2-Infix-Outfix Codes

The theory of codes is a fertile area at the intersection of formal language theory, error detection and correction, data compression and data security [6]. Theoretical research into codes is often interested with combinatorial properties of formal languages related to codes. In particular, there has been substantial recent interest in classes of codes defined by certain “finite subset” conditi...